ABT with Clause Learning for Distributed SAT
نویسندگان
چکیده
Transforming a planning instance into a propositional formula φ to be solved by a SAT solver is a common approach in AI planning. In the context of multiagent planning, this approach causes the distributed SAT problem: given φ distributed among agents –each agent knows a part of φ but no agent knows the whole φ–, check if φ is SAT or UNSAT by message passing. On the other hand, Asynchronous Backtracking (ABT) is a complete distributed constraint satisfaction algorithm, so it can be directly used to solve distributed SAT. Clause learning is a technique, commonly used in centralized SAT solvers, that can be applied to enhance ABT efficiency when used for distributed SAT. We prove that ABT with clause learning remains correct and complete. Experiments on several planning benchmarks show very substantial benefits for ABT with clause learning.
منابع مشابه
Connecting ABT with a SAT Solver
Many real-world problems are nowadays encoded into SAT instances and efficiently solved by CDCL SAT solvers. However, some scenarios require distributed problem solving approaches. Privacy is often the main reason. This causes the distributed SAT problem. In this work, we analyze how this problem can be tacked in an efficient way, and present ABTSAT, a new version of the ABT algorithm adapted t...
متن کاملIncorporating Clause Learning in Grid-Based Randomized SAT Solving
Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating clause learning, known to yield significant speed-ups in the sequential case, in such a distributed framework. The approach exploits existing state-of-the-art clause learning SAT solvers by embedding them with virtually no modifications. Th...
متن کاملIncorporating Learning in Grid-Based Randomized SAT Solving
Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, known to yield significant speed-ups in the sequential case, in such a distributed framework. The approach exploits existing state-ofthe-art clause learning SAT solvers by embedding them with virtually no modifications. We show th...
متن کاملA Restriction of Extended Resolution for Clause Learning SAT Solvers
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretically explained by showing that the clause learning framework is an implementation of a proof system which is as poweful as resolution. However, exponential lower bounds are known for resolution, which suggests that signi...
متن کاملClause Learning in SAT
The development of clause learning has had a tremendous effect on the overall performance of SAT-Solvers. Clause learning has allowed SAT-Solvers to tackle industrial sized problems that formerly would have required impractical time scales. The development of techniques for efficient clause management and storage have also proved important in reducing some of the memory usage problems inherent ...
متن کامل